GRAANK: Exploiting Rank Correlations for Extracting Gradual Itemsets
نویسندگان
چکیده
Gradual dependencies of the form the more A, the more B offer valuable information that linguistically express relationships between variations of the attributes. Several formalisations and automatic extraction algorithms have been proposed recently. In this paper, we first present an overview of these methods. We then propose an algorithm that combines the principles of several existing approaches and benefits from efficient computational properties to extract frequent gradual itemsets.
منابع مشابه
Mining Frequent Gradual Itemsets from Large Databases
Mining gradual rules plays a crucial role in many real world applications where huge volumes of complex numerical data must be handled, e.g., biological databases, survey databases, data streams or sensor readings. Gradual rules highlight complex order correlations of the form “The more/less X, then the more/less Y ”. Such rules have been studied since the early 70’s, mostly in the fuzzy logic ...
متن کاملAccelerating Effect of Attribute Variations: Accelerated Gradual Itemsets Extraction
Gradual itemsets of the form “the more/less A, the more/less B” summarize data through the description of their internal tendencies, identified as correlation between attribute values. This paper proposes to enrich such gradual itemsets by taking into account an acceleration effect, leading to a new type of gradual itemset of the form “the more/less A increases, the more quickly B increases”. I...
متن کاملCluster Based Partition Approach for Mining Frequent Itemsets
Data Mining is the process of extracting interesting and previously unknown patterns and correlations form huge data stored in databases. Association rule mininga descriptive mining technique of data mining, is the process of discovering items or literals which tend to occur together in transactions. As the data to be mined is large, the time taken for accessing data is considerable. This paper...
متن کاملA New Approach for Mining Top-Rank-k Erasable Itemsets
Erasable itemset mining first introduced in 2009 is an interesting variation of pattern mining. The managers can use the erasable itemsets for planning production plan of the factory. Besides the problem of mining erasable itemsets, the problem of mining top-rank-k erasable itemsets is an interesting and practical problem. In this paper, we first propose a new structure, call dPID_List and two ...
متن کاملItemset generalization with cardinality-based constraints
Generalized itemset mining is an established data mining technique that focuses on discovering high-level correlations among large databases. By exploiting a taxonomy built over the data items, items are aggregated into higher level concepts and, thus, data correlations at different abstraction levels can be discovered. However, since a large number of patterns can be extracted, the result of t...
متن کامل